Fast Shortest Paths Algorithms in the Presence of Few Negative Arcs
نویسندگان
چکیده
The shortest paths problem on weighted directed graphs is one of the basic network optimization problems. Its importance is mainly due to its applications in various areas, such as communication and transportation. Given a source node s in a weighted directed graph G, with n nodes and m arcs, the single-source shortest path problem (SSSP, for short) from s is the problem of finding the minimum weight paths from s to all other nodes of G. The all-pairs shortest paths problem (APSP, for short) consists in finding the minimum weight paths for each pair of nodes in G. In this paper we present hybrid algorithms for the SSSP and the APSP problems which are asymptotically fast when run on graphs with few negative weight arcs.
منابع مشابه
Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
Article history: Available online 10 April 2013
متن کاملFast paths on dynamic road networks
A recent industrial challenge for traffic information providers is to be able to compute point-to-point shortest paths very efficiently on road networks involving millions of nodes and arcs, where the arc costs represent travelling times that are updated every few minutes when new traffic information is available. Such stringent constraints defy classic shortest path algorithms. In this paper w...
متن کاملTwo fast algorithms for all-pairs shortest paths
In a large, dense network, the computation of the ‘distances’, i.e., the shortest path lengths between all pairs of nodes, can take a long time with algorithms known from the literature. We present two all-pairs shortest path algorithms, based on the equations of Bellman. These algorithms run fast, much faster than indicated by their time complexity bound of O(n2m), where n is the number of nod...
متن کاملSOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملA simple and fast label correcting algorithm for shortest paths
We propose a new method for ordering the candidate nodes in label correcting methods for shortest path problems. The method is equally simple but much faster than the D’ Esopo-Pape algorithm. It is similar to the threshold algorithm in that it tries to scan nodes with small labels as early as possible, and performs comparably with that algorithm. Our algorithm can also be combined with the thre...
متن کامل